Four Results on Randomized Incremental Constructions
نویسندگان
چکیده
Raimund Seidel§ We prove four results on randomized incremental constructions (RIes): • an analysis of the expected behavior under insertion and deletions, • a fully dynamic data structure for convex hull mamtenance in arbitrary dimensions, • a tail estimate for the space complexity of RIes, • a lower bound on the complexity of agame related to RIes.
منابع مشابه
Blocked Randomized Incremental Constructions
Randomized incremental constructions are widely used in computational geometry, but they perform very badly on large data because of their inherently random memory access patterns. We define an insertion order which removes enough randomness to significantly improve performance, but leaves enough randomness so that the algorithms remain theoretically optimal.
متن کاملLimited Randomness
7 A Sketch of a Research Immersion Lab/Master Thesis: Randomized Algorithms with Limited Randomness 7 7.1 Experimental Work: Quicksort . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 7 7.2 Experimental Work: Randomized Incremental Constructions . . . . . . . . . . . . . . . . 7 7.3 Theoretical Work . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . ....
متن کاملSpeculative Parallelization of a Randomized Incremental Convex Hull Algorithm
Finding the fastest algorithm to solve a problem is one of the main issues in Computational Geometry. Focusing only on worst case analysis or asymptotic computations leads to the development of complex data structures or hard to implement algorithms. Randomized algorithms appear in this scenario as a very useful tool in order to obtain easier implementations within a good expected time bound. H...
متن کاملLinear-Time Delaunay Triangulations Simplified∗
Recently it was shown that — under reasonable assumptions — Voronoi diagrams and Delaunay triangulations of planar point sets can be computed in time o(n log n), beating the classical comparisonbased lower bound. A number of increasingly faster randomized algorithms have been proposed, most recently a linear-time algorithm based on a randomized incremental construction that uses a combination o...
متن کاملQuicksort and Randomized Incremental Constructions
This is Section 5.4 in Mehlhorn/Sanders [DMS14, MS08] Quicksort is a divide-and-conquer algorithm. Let S be the set to be sorted. We select a uniformly random element p from S and split S into three parts. The set S< of elements smaller than p, the set S= of elements equal to p and the set S> of elements larger than p. The element p is usually called the pivot. Then we apply the algorithm recur...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1992